Applications of Jga to Operations Management and Vehicle Routing

نویسندگان

  • Andrés L. Medaglia
  • Eliécer Gutiérrez
چکیده

Two of the most complex activities in production and operations management (POM) are inventory planning and operations scheduling. This chapter presents two problems related to these activities, namely, the capacitated lot-sizing and scheduling problem and the capacitated vehicle routing problem. For each of these problems, the authors discuss several solution methods, present a competitive genetic algorithm, and describe its implementation in the Java Genetic Algorithm (JGA) framework. The purpose of this chapter is to illustrate how to use JGA to model and solve complex business problems arising in POM. The authors show that JGAbased solutions are quite competitive and easier to implement than widely used methods found in the literature.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Object-Oriented Framework for Rapid Development of Genetic Algorithms with Application to Operations Management and Vehicle Routing

An Object-Oriented Framework for Rapid Development of Genetic Algorithms with Application to Operations Management and Vehicle Routing Andrés L. Medaglia [email protected] Eliécer Gutiérrez [email protected] Centro para la Optimización y Probabilidad Aplicada http://copa.uniandes.edu.co Departmento de Ingeniería Industrial Universidad de los Andes Bogotá D.C., Colombia June 29, 20...

متن کامل

A multi-product vehicle routing scheduling model with time window constraints for cross docking system under uncertainty: A fuzzy possibilistic-stochastic programming

Mathematical modeling of supply chain operations has proven to be one of the most complex tasks in the field of operations management and operations research. Despite the abundance of several modeling proposals in the literature; for vast majority of them, no effective universal application is conceived. This issue renders the proposed mathematical models inapplicable due largely to the fact th...

متن کامل

A green vehicle routing problem with customer satisfaction criteria

This paper develops an MILP model, named Satisfactory-Green Vehicle Routing Problem. It consists of routing a heterogeneous fleet of vehicles in order to serve a set of customers within predefined time windows. In this model in addition to the traditional objective of the VRP, both the pollution and customers’ satisfaction have been taken into account. Meanwhile, the introduced model prepares a...

متن کامل

Modeling and Solving the Multi-depot Vehicle Routing Problem with Time Window by Considering the Flexible end Depot in Each Route

This paper considers the multi-depot vehicle routing problem with time window in which each vehicle starts from a depot and there is no need to return to its primary depot after serving customers. The mathematical model which is developed by new approach aims to minimizing the transportation cost including the travelled distance, the latest and the earliest arrival time penalties. Furthermore, ...

متن کامل

A Novel Heuristic Algorithm Based on Clark and Wright Algorithm for Green Vehicle Routing Problem

A significant portion of Gross Domestic Production (GDP) in any country belongs to the transportation system. Transportation equipment, in the other hand, is supposed to be great consumer of oil products. Many attempts have been assigned to the vehicles to cut down Greenhouse Gas (GHG). In this paper a novel heuristic algorithm based on Clark and Wright Algorithm called Green Clark and Wright (...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016